Random graphs

Results: 338



#Item
111

Stat Inference Stoch Process:231–253 DOIs11203y A latent process model for time series of attributed random graphs N. H. Lee · C. E. Priebe

Add to Reading List

Source URL: www.cis.jhu.edu

Language: English - Date: 2011-10-28 08:57:23
    112Graph theory / Mathematics / Graph coloring / Combinatorial optimization / Matching / NP-complete problems / Bipartite graph / Union-closed sets conjecture / Maximal independent set / Triangle-free graph

    The union-closed sets conjecture almost holds for almost all random bipartite graphs Henning Bruhn and Oliver Schaudt Abstract Frankl’s union-closed sets conjecture states that in every finite unionclosed family of set

    Add to Reading List

    Source URL: www.zaik.uni-koeln.de

    Language: English - Date: 2013-05-11 13:53:39
    113

    Random intersection graphs with tunable degree distribution and clustering Maria Deijfen∗ Willemien Kets†

    Add to Reading List

    Source URL: tuvalu.santafe.edu

    Language: English - Date: 2008-08-06 13:11:26
      114

      PTAS for maximum weight independent set problem with random weights in bounded degree graphs David Gamarnik ∗

      Add to Reading List

      Source URL: www2.isye.gatech.edu

      Language: English - Date: 2010-01-29 01:03:37
        115

        CHROMATIC THRESHOLDS IN DENSE RANDOM GRAPHS arXiv:1508.03870v1 [math.CO] 16 Aug 2015 ¨ PETER ALLEN, JULIA BOTTCHER,

        Add to Reading List

        Source URL: arxiv.org

        Language: English - Date: 2015-08-17 20:40:32
          116

          Structure of Preferential Attachment Networks Sidney Redner, Boston University collaborators: P. Krapivsky, F. Leyvraz Random and Dynamic Graphs & Networks, IPAM, May 2007

          Add to Reading List

          Source URL: physics.bu.edu

          Language: English - Date: 2007-05-09 17:12:53
            117

            Distribution of the Size of a Largest Planar Matching and Largest Planar Subgraph in Random Bipartite Graphs M ARCOS K IWI∗ M ARTIN L OEBL†

            Add to Reading List

            Source URL: iti.mff.cuni.cz

            Language: English - Date: 2016-02-04 05:53:37
              118

              arXiv:1104.2132v2 [math.CO] 15 FebOn the tree–depth of random graphs ∗ G. Perarnau and O.Serra February 16, 2012

              Add to Reading List

              Source URL: arxiv.org

              Language: English - Date: 2012-02-16 00:29:30
                119Graph theory / Graph coloring / Random graph / Triangle-free graph / Extremal graph theory / Interval edge coloring / Line graph

                THE TYPICAL STRUCTURE OF SPARSE Kr+1 -FREE GRAPHS arXiv:1307.5967v1 [math.CO] 23 Jul 2013 ´ JOZSEF

                Add to Reading List

                Source URL: arxiv.org

                Language: English - Date: 2013-07-23 20:20:52
                120Graph theory / NP-complete problems / Graph coloring / Graph / Global Positioning System / Random graph

                Practical Conflict Graphs for Dynamic Spectrum Distribution Xia Zhou, Zengbin Zhang, Gang Wang, Xiaoxiao Yu§ , Ben Y. Zhao and Haitao Zheng Department of Computer Science, U. C. Santa Barbara, USA § Tsinghua University

                Add to Reading List

                Source URL: www.cs.ucsb.edu

                Language: English - Date: 2013-03-23 01:40:10
                UPDATE